On the Group of Alternating Colored Permutations
نویسندگان
چکیده
The group of alternating colored permutations is the natural analogue of the classical alternating group, inside the wreath product Zr ≀Sn. We present a ‘Coxeterlike’ presentation for this group and compute the length function with respect to that presentation. Then, we present this group as a covering of Z r 2 ≀ Sn and use this point of view to give another expression for the length function. We also use this covering to lift several known parameters of Z r 2 ≀Sn to the group of alternating colored permutations.
منابع مشابه
A Combinatorial Proof for the Alternating Convolution of the Central Binomial Coefficients
We give a combinatorial proof of the identity for the alternating convolution of the central binomial coefficients. Our proof entails applying an involution to certain colored permutations and showing that only permutations containing cycles of even length remain. The combinatorial identity
متن کاملCombinatorics in the group of parity alternating permutations
We call a permutation parity alternating, if its entries assume even and odd integers alternately. Parity alternating permutations form a subgroup of the symmetric group. This paper deals with such permutations classified by two permutation statistics; the numbers of ascents and inversions. It turns out that they have a close relationship to signed Eulerian numbers. The approach is based on a s...
متن کاملMore Combinatorics of Fulton’s Essential Set
Abstract We develop combinatorics of Fulton’s essential set particularly with a connection to Baxter permutations. For this purpose, we introduce a new idea: dual essential sets. Together with the original essential set, we reinterpret Eriksson-Linusson’s characterization of Baxter permutations in terms of colored diagrams on a square board. We also discuss a combinatorial structure on local mo...
متن کاملCounting involutory, unimodal, and alternating signed permutations
In this work we count the number of involutory, unimodal, and alternating elements of the group of signed permutations Bn, and the group of even-signed permutations Dn. Recurrence relations, generating functions, and explicit formulas of the enumerating sequences are given. © 2006 Elsevier B.V. All rights reserved. MSC: primary: 05A15; secondary: 05A19; 05A05
متن کاملPermutation Generators of Alternating Groups
using elementary permutations also called modules These modules have a simple structure and are based on internal smaller permutations Two cases are considered In the rst the modules apply internal permutations only It has been proved that the composition of modules generates the alternating group for the number of binary inputs bigger than In the second DES like modules are considered and it i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 21 شماره
صفحات -
تاریخ انتشار 2014